Modified dynamic hashing
نویسندگان
چکیده
منابع مشابه
Dynamic Space Efficient Hashing
We consider space efficient hash tables that can grow and shrink dynamically and are always highly space efficient, i.e., their space consumption is always close to the lower bound even while growing and when taking into account storage that is only needed temporarily. None of the traditionally used hash tables have this property. We show how known approaches like linear probing and bucket cuck...
متن کاملUnified Dynamic Hashing
This paper attempts to unify a variety of dynamic hashing methods. Spiral storage, linear hashing and to a certain extent, linear hashing with partial expansions can be seen as particular cases of a more general technique. The approach is closest to spiral storage in concept. A new instantiation of the general method is offered which permits an adjustment to the dynamic growth rate during expan...
متن کاملDynamic Perfect Hashing: Upper and Lower Bounds
The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a randomized algorithm for the dynamic dictionary problem that takes O(1) worst-case time for lookups and O(1) amortized expected time for insertions and deletions; it uses space proportional to the size of...
متن کاملDynamic Hashing: Adaptive Metadata Management for Petabyte-scale File Systems∗
In a petabyte-scale file system, metadata access performance and scalability will significantly affect the whole system’s performance and scalability. We present a new approach called Dynamic Hashing (DH) for metadata management. DH introduces the RELAB (RElative LoAd Balancing) strategy to adjust the metadata distribution when the workload changes dynamically. Elasticity strategy is proposed t...
متن کاملDynamic Multi-View Hashing for Online Image Retrieval
Advanced hashing technique is essential in large scale online image retrieval and organization, where image contents are frequently changed. While traditional multi-view hashing method has achieve promising effectiveness, its batch-based learning based scheme largely leads to very expensive updating cost. Meanwhile, existing online hashing scheme generally focuses on single-view data. Good effe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 1985
ISSN: 0163-5808
DOI: 10.1145/971699.318917